Three-mode factor analysis by means of Candecomp/Parafac.
نویسندگان
چکیده
A three-mode covariance matrix contains covariances of N observations (e.g., subject scores) on J variables for K different occasions or conditions. We model such an JK×JK covariance matrix as the sum of a (common) covariance matrix having Candecomp/Parafac form, and a diagonal matrix of unique variances. The Candecomp/Parafac form is a generalization of the two-mode case under the assumption of parallel factors. We estimate the unique variances by Minimum Rank Factor Analysis. The factors can be chosen oblique or orthogonal. Our approach yields a model that is easy to estimate and easy to interpret. Moreover, the unique variances, the factor covariance matrix, and the communalities are guaranteed to be proper, a percentage of explained common variance can be obtained for each variable-condition combination, and the estimated model is rotationally unique under mild conditions. We apply our model to several datasets in the literature, and demonstrate our estimation procedure in a simulation study.
منابع مشابه
On Fast Computation of Gradients for CANDECOMP/PARAFAC Algorithms
Product between mode-n unfolding Y(n) of an N-D tensor Y and Khatri-Rao products of (N − 1) factor matrices A(m), m = 1, . . . , n − 1, n + 1, . . . , N exists in algorithms for CANDECOMP/PARAFAC (CP). If Y is an error tensor of a tensor approximation, this product is the gradient of a cost function with respect to factors, and has the largest workload in most CP algorithms. In this paper, a fa...
متن کاملTensor Deflation for CANDECOMP/PARAFAC. Part 3: Rank Splitting
CANDECOMP/PARAFAC (CPD) approximates multiway data by sum of rank-1 tensors. Our recent study has presented a method to rank-1 tensor deflation, i.e. sequential extraction of the rank-1 components. In this paper, we extend the method to block deflation problem. When at least two factor matrices have full column rank, one can extract two rank-1 tensors simultaneously, and rank of the data tensor...
متن کاملFinding the limit of diverging components in three-way Candecomp/Parafac - A demonstration of its practical merits
Three-way Candecomp/Parafac (CP) is a three-way generalization of principal component analysis (PCA) for matrices. Contrary to PCA, a CP decomposition is rotationally unique under mild conditions. However, a CP analysis may be hampered by the non-existence of a best-fitting CP decomposition with R ≥ 2 components. In this case, fitting CP to a three-way data array results in diverging CP compone...
متن کاملThree-way component analysis with smoothness constraints
Tucker3 Analysis and CANDECOMP=PARAFAC (CP) are closely related methods for threeway component analysis. Imposing constraints on the Tucker3 or CP solutions can be useful to improve estimation of the model parameters. In the present paper, a method is proposed for applying smoothness constraints on Tucker3 or CP solutions, which is particularly useful in analysing functional three-way data. The...
متن کاملUniqueness Proof for a Family of Models Sharing Features of Tucker’s Three-mode Factor Analysis and Parafac/candecomp
Some existing three-way factor analysis and MDS models incorporate Cattell’s "Principle of Parallel Proportional Profiles". These models can--with appropriate data---empirically determine a unique best fitting axis orientation without the need for a separate factor rotation stage, but they have not been general enough to deal with what Tucker has called "interactions" among dimensions. This art...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Psychometrika
دوره 79 3 شماره
صفحات -
تاریخ انتشار 2014